Description: In this project we analyze and design the minimum mean-square error (MMSE) multiuser receiver for uniformly quantized synchronous code division multiple access (CDMA) signals in additive white Gaussian noise (AWGN) channels.This project is mainly based on the representation of uniform quantizer by gain plus additive noise model. Based on this model, we derive the weight vector and the output signal-to-interference ratio (SIR) of the MMSE receiver. The effects of quantization on the MMSE receiver performance is characterized in a single parameter named 鈥漞quivalent noise variance鈥? The optimal quantizer stepsize which maximizes the MMSE receiver output SNR is also determined.-In this project we analyze and design the minimum mean-square error (MMSE) multiuser receiver for uniformly quantized synchronous code division multiple access (CDMA) signals in additive white Gaussian noise (AWGN) channels.This project is mainly based on the representation of uniform quantizer by gain plus additive noise model. Based on this model, we derive the weight vector and the output signal-to-interference ratio (SIR) of the MMSE receiver. The effects of quantization on the MMSE receiver performance is characterized in a single parameter named 鈥漞quivalent noise variance鈥? The optimal quantizer stepsize which maximizes the MMSE receiver output SNR is also determined. Platform: |
Size: 147456 |
Author:prasad |
Hits:
Description: 基于 DCT(离散余弦变换 )域的信息隐藏算法是目前应用最广的变换域算法 ,此类算法的最大不足是嵌信息量小。通过分析 DCT域隐藏算法隐藏容量少的原因 ,提出了一种大容量的 DCT域信息隐藏算法。算法首先对载体图像进行频谱均匀化处理 ,然后对图像进行全局 DCT变换 ,并将隐藏信息嵌入到载体图像的低频 DCT系数上 ,信息嵌入采用分段量化的方法实现 ,提取隐藏信息时不需要原始载体图像。实验结果表明 ,该算法的嵌入容量大 ,不可感知性好。-Based on DCT (discrete cosine transform) domain information hiding algorithm is the most widely used transform domain algorithms, the largest of these algorithms is the lack of a small amount of information embedded. Hiding Algorithm for DCT domain by analyzing the hidden reasons for the low capacity, a large capacity of information hiding algorithm for DCT domain. Firstly, the spectrum of the carrier image homogenization, and then the image is a global DCT transformation, and hidden information embedded into the image of the low-frequency DCT coefficients, the information embedded in the methods used to achieve sub-quantization, extract hidden information without the original Vector image. Experimental results show that the algorithm embedding capacity, can not be perceived good. Platform: |
Size: 10746880 |
Author:Mandala |
Hits:
Description: PAV (H265) 是 音视频 压缩解压 协议，非常不同于H264/MPEG4，ZPAV (H265) 的基本算法 是 小波，多级树集合群，广义小波，数学形态小波，......
ZPAV (H265) 基本算法 ：
1，图象与声音分解与合成 ：小波 ；
2，图象与声音前处理 ：小波子带零交叉降噪，目标纹理处理，语音处理 ；
3，速率控制 ：小波子带熵速率控制 ；
4，量化与反量化 ：小波子带熵量化与反量化 ；
5，低频分量和高频分量的降维 ：小波子带邻域交叉降维 ；
6，运动矢量和量化表的分解与合成 ：广义小波 ；
7，位面编码 ：数学形态小波，多级树集合群，嵌入零树，位面降维 ；
8，位流编码 ：算术编码，熵编码 ；
9，运动估计 ：宏块最优决策，运动矢量预测 ；
A，运动搜索 ：钻石，大钻石，小钻石，方形 ；
B，图象与声音后处理 ：低通滤波，断点重构，宏块平滑 ；
C，误码纠错 ：矢量仿真，帧间仿真 。
-The PAV (H265) is the audio and video compression and decompression protocol, is very different from H264/MPEG4
ZPAV (H265) algorithm is a wavelet, multi-level tree collection group, and generalized wavelets, mathematical morphology, wavelet, ...
ZPAV (H265) algorithm:
1, image and sound decomposition and synthesis: wavelet
2, image and sound processing: wavelet sub-band zero-crossing noise, target texture processing, speech processing
3, the rate control: wavelet subband entropy rate control
4, quantization and inverse quantization: Wavelet subband entropy quantization and inverse quantization
5, the dimensionality reduction of the low frequency component and high frequency components: the wavelet subbands neighborhood cross-dimensionality reduction
6, the decomposition and synthesis of the motion vector and quantization tables: generalized wavelet
7, bit-plane coding: the mathematical form of wavelet multi-level tree collection group, embedded zerotree, bit plane Platform: |
Size: 4826112 |
Author:李阳 |
Hits:
Description: quantize the watermarked audio signal to test the robustness
input : vector representing the watermarked audio file
output : vector representing the watermarked audio file corrupted by a quantization proce-quantize the watermarked audio signal to test the robustness
input : vector representing the watermarked audio file
output : vector representing the watermarked audio file corrupted by a quantization process Platform: |
Size: 1024 |
Author:adil |
Hits:
Description: 基于组合码字的矢量量化编码算法与最新研究-Quantization coding algorithm based on the combination of the vector of the codeword with the latest research Platform: |
Size: 536576 |
Author:David |
Hits:
Description: Xvid（旧称为XviD）是一个开放源代码的MPEG-4视频编解码器，它是基于OpenDivX而编写的。Xvid是由一群原OpenDivX义务开发者在OpenDivX于2001年7月停止开发后自行开发的。Xvid支持多种编码模式，量化（Quantization）方式和范围控，运动侦测（Motion Search）和曲线平衡分配（Curve），动态关键帧距（I-frame interval），心理视觉亮度修正，演职员表选项，外部自定义控制，运动向量加速（Hinted ME）编码，画面优化解码等众多编码技术，对用户来说功能十分强大。-Xvid (formerly known XviD) is an open source MPEG-4 video codec, which is based OpenDivX and write. Xvid is a group of volunteer developers in the original OpenDivX OpenDivX stopped in July 2001 after the development of self-developed. Xvid support multiple coding modes, quantization (Quantization) method and scope of control, motion detection (Motion Search) and the equilibrium distribution curve (Curve), dynamic key frame distance (I-frame interval), psychological visual brightness correction, cast and crew option, an external custom control, motion vector acceleration (Hinted ME) encoding, decoding, and many screen optimization coding technique, the user is very powerful. Platform: |
Size: 838656 |
Author:wsl |
Hits:
Description: Compute quantization errors for an LPC_order element input vector for a VQ codebook.Loop over codebook.
Platform: |
Size: 1024 |
Author:lkxjcan |
Hits:
Description: 利用FFT快速计算，线性排列阵子方向图。- This function computes and returns the gain radiation pattern for a
linear array
It uses the FFT to computes the pattern
*INPUTS**********
Nr ==> number of elements dolr ==> element spacing (d) in lambda units
divided by lambda
theta0 = steering angle in degrees winid ==> use winid negative for no
window, winid positive to enter your window of size(Nr)
win is input window, NOTE that win must be an Nr X 1 row vector nbits ==>
number of bits used in the pahse shifters
negative nbits mean no quantization is used
*OUTPUTS******************
theta ==> real-space angle patternr ==> array radiation pattern in dBs
patterng ==> array directive gain pattern in dBs
***************************************** Platform: |
Size: 1024 |
Author:jiweijie |
Hits:
Description: 利用matlab对卢瑟福散射进行仿真。但是因为电子质量很小，而且a粒子和电子的碰撞近似为完全弹性碰撞（因为这种碰撞能量很小，不会发生能级间的跃迁），根据动量守恒和能量守恒可以知道，a粒子速度几乎不变，对实验的结果影响很小。电子如果被撞到的话，估计就会被撞飞了吧，也可能被a粒子或者靶中其他失去电子的阳离子俘获.利用平方反比有心力场中的第三运动积分—Runge-Lenz矢量,简化处理了卢瑟福散射、氢原子的量子化和氢原子园轨道的相对论修正问题.(221/5000
Matlab is used to simulate rutherford scattering. But because electronic quality is small, and particle collisions and electronic approximation for a completely elastic collision (because of the collision energy is very small, do not happen the transition between energy levels), according to the conservation of momentum and conservation of energy, can know a particle velocity is almost the same, little impact on the results of the experiment. Electronic, if be hit, estimates will be flying, may also be a particle or other loss in the target electronic cationic capture. Using the inverse square integral - Runge - Lenz, intentional force field in the third movement vector, simplify the processing the rutherford scattering, hydrogen atoms quantization and orbital relativistic correction problem) Platform: |
Size: 2048 |
Author:ironchen |
Hits:
Description: K-means聚类算法的matlab实现(k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells.) Platform: |
Size: 1024 |
Author:invoker`Z |
Hits:
Description: The feature vector of
an image can be derived from the histograms of its color
components and finally can set the number of bins in the color
histogram to obtain the feature vector of desired size. Thus the
grid code of an image is obtained through the quantization of the
feature vector derived from the histogram of the desired color
component of the image. In order to have similar features of the
images the grid code must be same for all Images in the grid Platform: |
Size: 2532942 |
Author:msujikumar87@gmail.com |
Hits:
Search - vector quantization